Exclusion-Freeness in Multi-party Exchange Protocols
نویسندگان
چکیده
In this paper we define a property for multi-party protocols called exclusion-freeness. In multi-party protocols respecting the strongest definition of this property, participants are sure that they will not be excluded from a protocol’s execution and, consequently, they do not have to trust each other any more. We study this property on a wellknown multi-party fair exchange protocol with an online trusted third party and we point out two attacks on this protocol breaking the fairness property and implying excluded participants. Finally, we propose a new multi-party fair exchange protocol with an online trusted third party respecting the strong exclusion-freeness property.
منابع مشابه
Meta-envy-free Cake-cutting and Pie-cutting Protocols
This paper discusses cake-cutting protocols when the cake is a heterogeneous good, represented by an interval on the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Meta-envy-free means there is no envy on role assignments, that is, no party wants to exchange his/her role in the protocol with the one of any o...
متن کاملExclusions and related trust relationships in multi-party fair exchange protocols
Some electronic commerce transactions are inherently performed between more than two parties. In this context, it is thus important to determine whether the underlying fair exchange protocols allowing the secure implementation of such transactions enable participants to exclude other entities from a protocol execution. This is an important point that has not been sufficiently addressed when ana...
متن کاملReceipt-Freeness as a Special Case of Anonymity in Epistemic Logic?
Formal methods have provided us with tools to check both anonymity of protocols and – more specifically – receipt-freeness of voting protocols. One of the frameworks used for proving anonymity is epistemic logic. However, to the best of our knowledge, epistemic logic has never been used to prove receipt-freeness of voting protocols. Still, the concept of indistinguishability used in formalizing...
متن کاملOn the Multiparty Communication Complexity of Testing Triangle-Freeness
In this paper we initiate the study of property testing in simultaneous and non-simultaneous multi-party communication complexity, focusing on testing triangle-freeness in graphs. We consider the coordinator model, where we have k players receiving private inputs, and a coordinator who receives no input; the coordinator can communicate with all the players, but the players cannot communicate wi...
متن کاملOptimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. We examine MFE scenarios where every participant has some item, and at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. This is a particularly hard scenario, even though...
متن کامل